An extension of min/max flow framework

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An extension of min/max flow framework

23 24 25 26 27 28 29 30 31 32 33 34 Article history: Received 30 January 2004 Received in revised form 15 September 2006 Accepted 7 May 2008 Available online xxxx

متن کامل

On DC optimization algorithms for solving minmax flow problems

We formulate minmax flow problems as a DC. optimization problem. We then apply a DC. primal-dual algorithm to solve the resulting problem. The obtained computational results show that the proposed algorithm is efficient thanks to particular structures of the minmax flow problems.

متن کامل

Evolutionary Algorithm for Minmax Regret Flow-shop Problem

Received: 1 June 2015 Abstract Accepted: 30 July 2015 The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally co...

متن کامل

AN EXTENSION TO STOCHASTIC TIME-COST TRADE-OFF PROBLEM OPTIMIZATION WITH DISCOUNTED CASH FLOW

In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...

متن کامل

An Investigation and Extension of a Hyper-heuristic Framework

Three modifications to the framework within which hyper-heuristic approaches operate are presented. The first modification automates a self learning mechanism for updating the values of parameters in the choice function used by the controller. Second, a procedure for dynamically configuring a range of lowlevel heuristics is described. Third, in order to effectively use this range of low-level h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Image and Vision Computing

سال: 2009

ISSN: 0262-8856

DOI: 10.1016/j.imavis.2008.05.006